Large-scale online ridesharing: the effect of assignment optimality on system performance

Mobility-on-demand (MoD) systems consist of a fleet shared vehicles that can be hailed for one-way point-to-point trips. The total distance driven by the and size reduced employing ridesharing, i.e., assigning multiple passengers to one vehicle. However, finding optimal passenger-vehicle assignment in an MoD system is hard combinatorial problem. In this work, we demonstrate how VGA method, recently proposed systematic method used compute assignments corresponding vehicle routes massive-scale system. contrast existing works, solve all problems optimality, regularly dealing with instances containing thousands passengers. Moreover, examine impact using ridesharing assignments, compare performance uses against computed insertion heuristic no ridesharing. We found subject maximum travel delay 4 minutes reduces 57% compared without Furthermore, result 20% reduction 5% lower average passenger heuristic.